Hierarchies of weakly monotone restarting automata
نویسندگان
چکیده
It is known that the weakly monotone restarting automata accept exactly the growing contextsensitive langauges. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.
منابع مشابه
Restarting Automata with Auxiliary Symbols and Small Lookahead
We present a study on lookahead hierarchies for restarting automata with auxiliary symbols and small lookahead. In particular, we show that there are just two different classes of languages recognised by RRWW automata, through the restriction of lookahead size. We also show that the respective (left-) monotone restarting automaton models characterise the context-free languages and that the resp...
متن کاملRestarting Automata and Variants of j-Monotonicity
In the literature various notions of (non-) monotonicity of restarting automata have been studied. Here we introduce two new variants of (non-) monotonicity for restarting automata and for two-way restarting automata: left (non-) monotonicity and right-left (non-) monotonicity. It is shown that for the various types of deterministic and nondeterministic (two-way) restarting automata without aux...
متن کاملOn h-Lexicalized Restarting Automata
Following some previous studies on restarting automata, we introduce a refined model – the hlexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics. We compare the input languages, which are the languages traditionally considered in automata theory, to the so-called basic and h-proper languages, which are (impl...
متن کاملLookahead Hierarchies of Restarting Automata
The restarting automaton is a special kind of the linear bounded automaton with a read/write window of fixed length. It works in cycles, reducing the length of the actual word in each cycle. We study several versions of restarting automata and we show several hierarchies of language classes recognized by them with respect to the size of the read/write-window.
متن کاملRelations and Transductions Realized by Restarting Automata
In the present thesis we introduce several ways of extending restarting automata to devices for realizing binary (word) relations, which is mainly motivated by linguistics. In particular, we adapt the notion of input/output-relations and proper-relations to restarting automata and to parallel communicating systems of two restarting automata (PC-systems). Further, we introduce a new model, calle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 39 شماره
صفحات -
تاریخ انتشار 2005